x = int(input())
def ck(w1,w2,m):
if w1 == w2:
return 0
res = 0
for i in range(m):
res +=abs(ord(w1[i])-ord(w2[i]))
return res
def cal(n,m,a):
ans = 26 * m
for i in range(n-1):
for j in range(i+1,n):
ans = min(ans,ck(a[i],a[j],m))
return ans
for jj in range(x):
n,m = [int(i) for i in input().split(' ')]
a = []
for i in range(n):
a.append(input())
print(cal(n,m,a))#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
for(int w=0;w<t;w++){
int n,m,i,j,min=0,k,a=0;
cin >> n >> m;
vector < string > v(n);
for(i=0;i<n;i++){
cin >> v[i];
}
for(i=0;i<m;i++){
min=min+abs((v[0])[i]-(v[1])[i]);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
for(k=0;k<m;k++){
a=a+abs((v[i])[k]-(v[j])[k]);
}
if(a<min){
min=a;
}
a=0;
}
}
cout << min << endl;
}
}222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |